Inverse problem for kidney concentrating mechanism
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولStructure and concentrating mechanism in the mammalian kidney.
SCHMIDT-NIELSEN, BODIL, AND ROBERTA O’DELL. Structure and concentrating mechanism in the mammalian kidney. Am. J. Physiol. 200 (6) : I I I g-I I 24. 1961 .-In a number of mammalian kidneys a close correlation was found between renal medullary thickness and ability to concentrate electrolytes in the urine, indicating that both outer and inner zone of the medulla act as a countercurrent multiplie...
متن کاملInverse nodal problem for p-Laplacian with two potential functions
In this study, inverse nodal problem is solved for the p-Laplacian operator with two potential functions. We present some asymptotic formulas which have been proved in [17,18] for the eigenvalues, nodal points and nodal lengths, provided that a potential function is unknown. Then, using the nodal points we reconstruct the potential function and its derivatives. We also introduce a solution of i...
متن کاملThe use of inverse quadratic radial basis functions for the solution of an inverse heat problem
In this paper, a numerical procedure for an inverse problem of simultaneously determining an unknown coefficient in a semilinear parabolic equation subject to the specification of the solution at an internal point along with the usual initial boundary conditions is considered. The method consists of expanding the required approximate solution as the elements of the inverse quadrati...
متن کاملInverse feasible problem
In many infeasible linear programs it is important to construct it to a feasible problem with a minimum pa-rameters changing corresponding to a given nonnegative vector. This paper defines a new inverse problem, called “inverse feasible problem”. For a given infeasible polyhedron and an n-vector a minimum perturba-tion on the parameters can be applied and then a feasible polyhedron is concluded.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1993
ISSN: 0893-9659
DOI: 10.1016/0893-9659(93)90102-s